Optimal Replica Placement in Graph Based Data Grids

--------------------------------------------------------------Abstract-----------------------------------------------------------The replica algorithms are built based on the topology of the data grid. The real representation of grid is general graph. So we propose an algorithm called Replica Placement in Graph Topology Grid (RPGTG) to place replicas on graph based data grids. In this paper, we address three issues concerning data replica placement in graph-based data grids. The first issue is how to minimize the data access time. The second issue is how to ensure load balance among replica servers. The third issue is how to minimize the unnecessary replications. To solve these entire issues, we propose a replica placement algorithm that finds the optimal locations for the replicas, which minimizes the data access time, ensure load balance of replica servers and determines the minimum number of replicas required.